Efficient and Effective Algorithms for Searching Strings in Secondary Storage

Grant number: DP110101743 | Funding period: 2011 - 2014

Completed

Abstract

Pattern searching is fundamental to a wide range of computing applications, including web search and bioinformatics. In this project we will develop compression algorithms and hybrid memory-disk search structures that allow fast pattern matching on sequences of textual and numeric data, including when approximate search is required.

Related publications (3)

On Identifying Phrases Using Collection Statistics

S Gog, A Moffat, M Petri

2015-01-01

The use of phrases as part of similarity computations can enhance search effectiveness. But the gain comes at a cost, either in te..

Large-scale pattern search using reduced-space on-disk suffix arrays

S Gog, A Moffat, JS Culpepper, A Turpin, A Wirth

2014-01-01

The suffix array is an efficient data structure for in-memory pattern search. Suffix arrays can also be used for external-memory p..

Score-Safe Term Dependency Processing With Hybrid Indexes

M Petri, A Moffat, JS Culpepper

2014-01-01

Score-safe index processing has received a great deal of attention over the last two decades. By pre-calculating maximum term impa..

University of Melbourne Researchers

Alistair Moffat